Large final polynomials from integer programming
نویسندگان
چکیده
We introduce a new method for finding non-realizability certificate of simplicial sphere Σ. It enables us to prove the first time balanced 2-neighborly 3-sphere by Zheng, family highly neighborly centrally symmetric spheres Novik and several combinatorial prismatoids introduced Criado Santos. The method, implemented in polymake framework, uses integer programming find monomial combination classical 3-term Plücker relations that must be positive any realization Σ; but since this should also vanish identically, cannot exist. Previous approaches Firsching, using SCIP, Gouveia, Macchia Wiebe, Singular Macaulay2, are not able process these examples.
منابع مشابه
Hypergeometric Polynomials and Integer Programming
We examine connections between A-hypergeometric di erential equations and the theory of integer programming. In the rst part, we develop a \hypergeometric sensitivity analysis" for small variations of constraint constants with creation operators and b-functions. In the second part, we study the indicial polynomial (b-function) along the hyperplane x i = 0 via a correspondence between the optima...
متن کاملScaffolding Large Genomes using Integer Linear Programming
The rapidly diminishing cost of genome sequencing is driving renewed interest in large scale genome sequencing programs such as Genome 10K (G10K). Despite renewed interest the assembly of large genomes from short reads is still an extremely resource intensive process. This work presents a scalable algorithms to create scaffolds, or ordered and oriented sets of assembled contigs, which is one pa...
متن کاملDISCRETE TOMOGRAPHY AND FUZZY INTEGER PROGRAMMING
We study the problem of reconstructing binary images from four projections data in a fuzzy environment. Given the uncertainly projections,w e want to find a binary image that respects as best as possible these projections. We provide an iterative algorithm based on fuzzy integer programming and linear membership functions.
متن کاملOn integer Chebyshev polynomials
We are concerned with the problem of minimizing the supremum norm on [0, 1] of a nonzero polynomial of degree at most n with integer coefficients. We use the structure of such polynomials to derive an efficient algorithm for computing them. We give a table of these polynomials for degree up to 75 and use a value from this table to answer an open problem due to P. Borwein and T. Erdélyi and impr...
متن کاملInteger-valued Polynomials
Let R be a Krull ring with quotient field K and a1, . . . , an in R. If and only if the ai are pairwise incongruent mod every height 1 prime ideal of infinite index in R does there exist for all values b1, . . . , bn in R an interpolating integer-valued polynomial, i.e., an f ∈ K[x] with f(ai) = bi and f(R) ⊆ R. If S is an infinite subring of a discrete valuation ring Rv with quotient field K a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Communications in Computer Algebra
سال: 2021
ISSN: ['1932-2232', '1932-2240']
DOI: https://doi.org/10.1145/3511528.3511533